Flowcharting the Meaning of Logic Formulas

نویسنده

  • Sabah Al-Fedaghi
چکیده

In logic, representation of a domain (e.g., physical reality) comprises the things its expressions (formulas) refer to and their relationships. Recent research has examined the realm of nonsymbolic representations, especially diagrams. It is claimed that, in general, diagrams have advantages over linguistic descriptions. Current diagrammatic representations of logic formulas do not completely depict their underlying semantics, and they lack a basic static structure that incorporates elementary dynamic features, creating a conceptual gap that can lead to misinterpretation. This paper demonstrates a methodology for mapping the sense of a logic formula and producing diagrams that integrate linguistic conception, truthvalues, and meaning and can be used in teaching, communication, and understanding, especially with students specializing in logic representation and reasoning. Keywords—knowledge representation; logic formulas; diagrammatic representation; sense

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear Formulas in Continuous Logic

We prove that continuous sentences preserved by the ultramean construction (a generalization of the ultraproduct construction) are exactly those sentences which are approximated by linear sentences. Continuous sentences preserved by linear elementary equivalence are exactly those sentences which are approximated in the Riesz space generated by linear sentences. Also, characterizations for linea...

متن کامل

Two-phase Logic Design by Hardware Flowcharts

The need for two-phase logic design is driven by marketing requirements to provide the most silicon efficient implementation of digital VLSI circuits. This has led to an industry wide development of more area efficient techniques that represent a departure from the traditional edgetriggered state machine methodology. In the past these techniques have been largely adhoc. However, we have develop...

متن کامل

Meaning Formulas for Syntax - Based Mathematical Algorithms ∗ Extended

Many symbolic algorithms work by manipulating mathematical expressions in a mathematically meaningful way. A meaning formula for such an algorithm is a statement that captures the mathematical relationship between the input and output expressions of the algorithm. For example, consider a symbolic differentiation algorithm that takes as input an expression (say x), repeatedly applies syntactic d...

متن کامل

Compositional Semantics for a Language of Imperfect Information

We describe a logic which is the same as first-order logic except that it allows control over the information that passes down from formulas to subformulas. For example the logic is adequate to express branching quantifiers. We describe a compositional semantics for this logic; in particular this gives a compositional meaning to formulas of the ‘information-friendly’ language of Hintikka and Sa...

متن کامل

Infinitary equilibrium logic and strongly equivalent logic programs

Strong equivalence is an important concept in the theory of answer set programming. Informally speaking, two sets of rules are strongly equivalent if they have the same meaning in any context. Equilibrium logic was used to prove that sets of rules expressed as propositional formulas are strongly equivalent if and only if they are equivalent in the logic of here-and-there. We extend this line of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016